An Asymptotically Optimal Push–Pull Method for Multicasting Over a Random Network
نویسندگان
چکیده
منابع مشابه
A Simple Asymptotically Optimal Filter over an Infinite Horizon
A filtering problem over an infinite horizon for a continuous time signal and discrete time observation in the presence of non Gaussian white noise is considered. Conditions are presented, under which a nonlinear Kalman type filter with limiter is asymptotically optimal in the mean square sense for long time intervals given provided the sampling frequency is sufficiently high.
متن کاملConvergence and Stability of Modified Random SP-Iteration for A Generalized Asymptotically Quasi-Nonexpansive Mappings
The purpose of this paper is to study the convergence and the almost sure T-stability of the modied SP-type random iterative algorithm in a separable Banach spaces. The Bochner in-tegrability of andom xed points of this kind of random operators, the convergence and the almost sure T-stability for this kind of generalized asymptotically quasi-nonexpansive random mappings are obtained. Our result...
متن کاملTowards Asymptotically Optimal Rapidly-exploring Random Sampling for Protein Folding
Incremental sampling-based algorithms have been recently shown to efficiently and optimally search high-dimensional and continuous spaces that are otherwise intractable to explore. Although these methods are commonly used to find motion plans in configuration spaces, they show promise for optimization problems in which globally-optimal solutions are needed. In this paper, state-of-the-art optim...
متن کاملMulticasting of correlated multisource to multisink over a network
The problem of network coding with multicast of a single source to multisink has first been studied by Ahlswede, Cai, Li and Yeung in 2000, in which they have established the celebrated max-flow mini-cut theorem on non-physical information flow over a network of independent channels. On the other hand, in 1980, Han has studied the case with correlated multisource and a single sink from the view...
متن کاملMulticasting correlated multi-source to multi-sink over a network
The problem of network coding for multicasting a single source to multiple sinks has first been studied by Ahlswede, Cai, Li and Yeung in 2000, in which they have established the celebrated max-flow mini-cut theorem on non-physical information flow over a network of independent channels. On the other hand, in 1980, Han has studied the case with correlated multiple sources and a single sink from...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2013
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2013.2253543